Factoring a lattice
نویسندگان
چکیده
منابع مشابه
Factoring the characteristic polynomial of a lattice
Article history: Received 31 October 2014 Available online xxxx
متن کاملFactoring via Strong Lattice Reduction Algorithms
We address to the problem to factor a large composite number by lattice reduction algorithms Schnorr Sc has shown that under a reasonable number theoretic assumptions this problem can be reduced to a simultaneous diophantine approximation problem The latter in turn can be solved by nding su ciently many short vectors in a suitably de ned lattice Using lattice basis reduction algorithms Schnorr ...
متن کاملTurning Euler's Factoring Method into a Factoring Algorithm
An algorithm is presented which, given a positive integer n, will either factor n or prove it to be prime. The algorithm takes O(«) steps.
متن کاملFactoring as a Service
The difficulty of integer factorization is fundamental to modern cryptographic security using RSA encryption and signatures. Although a 512-bit RSA modulus was first factored in 1999, 512-bit RSA remains surprisingly common in practice across many cryptographic protocols. Popular understanding of the difficulty of 512-bit factorization does not seem to have kept pace with developments in comput...
متن کاملFactoring Hecke Polynomials modulo A
Let T N,χ p,k (x) be the characteristic polynomial of the Hecke operator T p acting on the space of cusp forms S k (N, χ). We describe the factorization of T N,χ p,k (x) mod as k varies, and we explicitly calculate those factorizations for N = 1 and small. These factorizations are used to deduce the irreducibility of certain T 1,1 q,k (x) from the irreducibility of T 1,1 2,k (x).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1958
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1958-0094306-1